/*
 * @lc app=leetcode.cn id=3 lang=java
 *
 * [3] 无重复字符的最长子串
 */

// @lc code=start
class Solution {
    public int lengthOfLongestSubstring(String s) {
        int maxLength = 0;

        int[] recondlist = new int[s.length()];

        for (int i = 0; i < recondlist.length; i++) {
            for (int j = i; j < recondlist.length; j++) {
                if(s.charAt(i) == s.charAt(j)){
                    recondlist[i] = j;
                    break;
                }
            }
        }

        


        return maxLength;
    }
}
// @lc code=end

